|
|
Mining Multiple Level Association Rules
Nguyenová, Thanh Lam ; Burget, Radek (referee) ; Bartík, Vladimír (advisor)
This bachelor thesis deals with multiple level association rules mining. The aim of this work is to focus on available algorithms for mining multiple level association rules and to implement an application with a graphical user interface that will demonstrate the functionality of these algorithms. Five algorithms based on the Apriori algorithm were chosen. Experiments with each algorithm were performed using the application and the results were compared and evaluated at the end of the thesis.
|
|
|
Business Process Mining
Skácel, Jan ; Kreslíková, Jitka (referee) ; Bartík, Vladimír (advisor)
This thesis explains business process mining and it's principles. A substantial part is devoted to the problems of process discovery. Further, based on the analysis of specific manufacturing process are proposed three methods that are trying to identify shortcomings in the process. First discovers the manufacturing process and renders it into a graph. The second method uses simulator of production history to obtain products that may caused delays in the process. Acquired data are used to mine frequent itemsets. The third method tries to predict processing time on the selected workplace using asociation rules. Last two mentioned methods employ an algorithm Frequent Pattern Growth. The knowledge obtained from this thesis improve efficiency of the manufacturing process and enables better production planning.
|
|
|
Association Rules Mining
Dvořák, Michal ; Chmelař, Petr (referee) ; Stryka, Lukáš (advisor)
The main goal of this bachelor's thesis is design and implementation of the application that provides a comparison of the performance and time consumption of given algorithms for mining of the frequent itemsets and the association rules. For demonstration, the mining algorithms Apriori, AprioriTIDList, AprioriItemSet and the method using FP-tree were chosen. The tests were executed over various amounts of data and with different minimum support and confidence values as well. The application was implemented in the object oriented language C# and the relational database provided by MS SQL Server 2008 is used as the data source.
|
|
|
Knowledge Discovery over Data Warehouses
Pumprla, Ondřej ; Chmelař, Petr (referee) ; Stryka, Lukáš (advisor)
This Master's thesis deals with the principles of the data mining process, especially with the mining of association rules. The theoretical apparatus of general description and principles of the data warehouse creation is set. On the basis of this theoretical knowledge, the application for the association rules mining is implemented. The application requires the data in the transactional form or the multidimensional data organized in the Star schema. The implemented algorithms for finding of the frequent patterns are Apriori and FP-tree. The system allows the variant setting of parameters for mining process. Also, the validation tests and efficiency proofs were accomplished. From the point of view of the association rules searching support, the resultant application is more applicable and robust than the existing compared systems SAS Miner and Oracle Data Miner.
|
|
|
Mining Multiple Level Association Rules
Nguyenová, Thanh Lam ; Burget, Radek (referee) ; Bartík, Vladimír (advisor)
This bachelor thesis deals with multiple level association rules mining. The aim of this work is to focus on available algorithms for mining multiple level association rules and to implement an application with a graphical user interface that will demonstrate the functionality of these algorithms. Five algorithms based on the Apriori algorithm were chosen. Experiments with each algorithm were performed using the application and the results were compared and evaluated at the end of the thesis.
|
|
|
Association Rules Mining
Dvořák, Michal ; Chmelař, Petr (referee) ; Stryka, Lukáš (advisor)
The main goal of this bachelor's thesis is design and implementation of the application that provides a comparison of the performance and time consumption of given algorithms for mining of the frequent itemsets and the association rules. For demonstration, the mining algorithms Apriori, AprioriTIDList, AprioriItemSet and the method using FP-tree were chosen. The tests were executed over various amounts of data and with different minimum support and confidence values as well. The application was implemented in the object oriented language C# and the relational database provided by MS SQL Server 2008 is used as the data source.
|
|
|
Knowledge Discovery over Data Warehouses
Pumprla, Ondřej ; Chmelař, Petr (referee) ; Stryka, Lukáš (advisor)
This Master's thesis deals with the principles of the data mining process, especially with the mining of association rules. The theoretical apparatus of general description and principles of the data warehouse creation is set. On the basis of this theoretical knowledge, the application for the association rules mining is implemented. The application requires the data in the transactional form or the multidimensional data organized in the Star schema. The implemented algorithms for finding of the frequent patterns are Apriori and FP-tree. The system allows the variant setting of parameters for mining process. Also, the validation tests and efficiency proofs were accomplished. From the point of view of the association rules searching support, the resultant application is more applicable and robust than the existing compared systems SAS Miner and Oracle Data Miner.
|
|
|
Frequent Pattern Discovery in a Data Stream
Dvořák, Michal ; Hlosta, Martin (referee) ; Zendulka, Jaroslav (advisor)
Frequent-pattern mining from databases has been widely studied and frequently observed. Unfortunately, these algorithms are not suitable for data stream processing. In frequent-pattern mining from data streams, it is important to manage sets of items and also their history. There are several reasons for this; it is not just the history of frequent items, but also the history of potentially frequent sets that can become frequent later. This requires more memory and computational power. This thesis describes two algorithms: Lossy Counting and FP-stream. An effective implementation of these algorithms in C# is an integral part of this thesis. In addition, the two algorithms have been compared.
|
|
|
Business Process Mining
Skácel, Jan ; Kreslíková, Jitka (referee) ; Bartík, Vladimír (advisor)
This thesis explains business process mining and it's principles. A substantial part is devoted to the problems of process discovery. Further, based on the analysis of specific manufacturing process are proposed three methods that are trying to identify shortcomings in the process. First discovers the manufacturing process and renders it into a graph. The second method uses simulator of production history to obtain products that may caused delays in the process. Acquired data are used to mine frequent itemsets. The third method tries to predict processing time on the selected workplace using asociation rules. Last two mentioned methods employ an algorithm Frequent Pattern Growth. The knowledge obtained from this thesis improve efficiency of the manufacturing process and enables better production planning.
|
guest ::
